Approximately Dominating Representatives
نویسندگان
چکیده
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point set consist of a few points guaranteed to contain an approximate optimum of any monotone Lipschitz continuous combining function of the dimensions. ADRs can be computed by appropriately post-processing Pareto, or “skyline,” queries [14, 1]. We show that the problem of minimizing the number of points returned, for a user-specified desired approximation, can be solved in polynomial time in two dimensions; for three and more it is NP-hard but has a polynomial-time logarithmic approximation. Finally, we present a polynomial-time, constant factor approximation algorithm for three
منابع مشابه
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes
Garnero et al. [SIAM J. Discrete Math. 2015, 29(4):1864–1894] recently introduced a framework based on dynamic programming to make applications of the protrusion replacement technique constructive and to obtain explicit upper bounds on the involved constants. They show that for several graph problems, for every boundary size t one can find an explicit setRt of representatives. Any subgraph H wi...
متن کاملEnhanced dominant pruning applied to the route discovery process of on-demand routing protocols
Dominant Pruning (DP) is a distributed connected dominating-set algorithm that can be used for reducing the impact of flooding in wireless ad hoc networks. We propose an enhanced dominant pruning (EDP) approach to be used in the route discovery process of on-demand routing protocols. To show the benefits of EDP, we integrate EDP into the Ad-hoc On-demand Distance Vector (AODV) protocol. We pres...
متن کاملA Simulation-based Performance Comparison of the Minimum Node Size and Stability-based Connected Dominating Sets for Mobile Ad Hoc Networks
The high-level contribution of this paper is a simulation-based comparison of two contrasting categories (minimum node size vs. stability) of connected dominating sets for mobile ad hoc networks. We pick the maximum density-based CDS (MaxD-CDS) and Node ID-based CDS (ID-CDS) to be representatives of the minimum node size-based CDS algorithms; the minimum velocity-based CDS (MinV-CDS) and the no...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملمحک پیشرو بودن شاخص ها قیمت سهام در بورس تهران
The financial and economic analysts are always eager to have an approximately accurate forecast (prediction) of economic condition of the country, and assess (estimate) their economic evolutions with acceptable level of error. Therefore, they especially pay attention to stock indexes which are representatives of country’s future economic conditions. This paper surveys the relation between stock...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 371 شماره
صفحات -
تاریخ انتشار 2005